First-mover advantage in round-robin tournaments
نویسندگان
چکیده
We study round-robin tournaments with either three or four symmetric players whose values of winning are common knowledge. In the round-robin tournament with three players there are three stages, each of which includes one match between two players. The player who wins in two matches wins the tournament. We characterize the sub-game perfect equilibrium and show that each player maximizes his expected payo¤ and his probability to win if he competes in the rst and the last stages of the tournament. In the round-robin tournament with four players there are three rounds, each of which includes two sequential matches where each player plays against a di¤erent opponent in every round. We characterize the sub-game perfect equilibrium and show that a player who plays in the rst match of each of the rst two rounds has a rst-mover advantage as reected by a signi cantly higher winning probability as well as a signi cantly higher expected payo¤ than his opponents. JEL Classi cations: D44, O31 Keywords: All-pay contests, round-robin tournaments, rst-mover advantage. Department of Economics and Business Administration, Ariel University, Ariel 40700, Israel. Email: [email protected] yDepartment of Managing Human Resources, Department of Practical Economics, Sapir Academic College, M.P. Hof Ashkelon 79165, Israel. zCorresponding author: Department of Economics, Ben-Gurion University of the Negev, BeerSheva 84105, Israel. Tel: 972-86472309. Fax: 972-86472941.
منابع مشابه
Preemptive Behavior in Sequential-Move Tournaments with Heterogeneous Agents
Rank-order tournaments are usually modeled simultaneously. However, real tournaments are often sequential. We show that agents’ strategic behavior in sequential-move tournaments significantly differ from the one in simultaneous-move tournaments: In a sequential-move tournament with heterogeneous agents, there may be either a first-mover or a second-mover advantage. Under certain conditions the ...
متن کاملBrother Avoiding Round Robin Doubles Tournaments II
We investigate brother avoiding round robin doubles tournaments and construct several infinite families. We show that there is a BARRDT(n) that is not a SAMDRR(n) for all n > 4.
متن کاملAn Evaluation of Ranking Methods for Multiple Incomplete Round-robin Tournaments
We investigate the ability of various methods to reveal the true ranking of players competing in multiple incomplete round-robin tournaments, which arise when not all tournament competitions are held. Statistical and graphical analyses in this simulation-based study reveal that a method based on players' average winning percentages is usually best.
متن کاملRound-robin tournaments with homogeneous rounds
We study round-robin tournaments for n teams, where in each round a fixed number (g) of teams is present and each team present plays a fixed number (m) of matches in this round. In the tournament each match between two teams is either played once or twice, in the latter case in different rounds. We give necessary combinatorial conditions on the triples (n, g,m) for which such round-robin tourna...
متن کاملStability Improvement of Hydraulic Turbine Regulating System Using Round-Robin Scheduling Algorithm
The sustainability of hydraulic turbines was one of the most important issues considered by electrical energy provider experts. Increased electromechanical oscillation damping is one of the key issues in the turbines sustainability. Electromechanical oscillations, if not quickly damp, can threaten the stability of hydraulic turbines and causes the separation of different parts of the netw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Social Choice and Welfare
دوره 48 شماره
صفحات -
تاریخ انتشار 2017